Generating All Simple Convexly-Drawable Polar Symmetric 6-Venn Diagrams
نویسندگان
چکیده
An n-Venn diagram consists of n curves that divide the plane into 2 connected regions, one region for each possible intersection of the interiors of the curves. We show there are exactly 406 6-Venn diagrams that (a) have 6 curves, (b) are simple (at most two curves intersect at any point), (c) can be drawn with all curves convex, and (d) are invariant under polar ips", a type of inversion symmetry. Joint with Frank Ruskey.
منابع مشابه
Symmetric Monotone Venn Diagrams with Seven Curves
An n-Venn diagram consists of n curves drawn in the plane in such a way that each of the 2 possible intersections of the interiors and exteriors of the curves forms a connected non-empty region. A k-region in a diagram is a region that is in the interior of precisely k curves. A n-Venn diagram is symmetric if it has a point of rotation about which rotations of the plane by 2π/n radians leaves t...
متن کاملGenerating simple convex Venn diagrams
In this paper we are concerned with producing exhaustive lists of simple monotone Venn diagrams that have some symmetry (non-trivial isometry) when drawn on the sphere. A diagram is simple if at most two curves intersect at any point, and it is monotone if it has some embedding on the plane in which all curves are convex. We show that there are 23 such 7-Venn diagrams with a 7-fold rotational s...
متن کاملNew Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves
A symmetric n-Venn diagram is one that is invariant under n-fold rotation, up to a relabeling of curves. A simple n-Venn diagram is an n-Venn diagram in which at most two curves intersect at any point. In this paper, we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search restricted to diagrams with crosscut symme...
متن کاملThe Search for Symmetric Venn Diagrams
Given a family C = {C 1 , C 2 , ..., C n } of n simple (Jordan) curves which intersect pairwise in finitely many points, we say that it is an independent family if each of the 2 n sets is not empty, where X j denotes one of the two connected components of the complement of C j (that is, each X j is either the interior or the exterior of C j). If, moreover, each of the sets in (*) is connected, ...
متن کاملVenn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice Preliminary Draft
In this paper we show that symmetric Venn diagrams for n sets exist for every prime n, settling an open question. Until this time, n = 11 was the largest prime for which the existence of such diagrams had been proven. We show that the problem can be reduced to finding a symmetric chain decomposition, satisfying a certain cover property, in a subposet of the Boolean lattice Bn, and prove that su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011